Pseudocyclic association schemes and strongly regular graphs
نویسندگان
چکیده
منابع مشابه
1 6 A pr 2 00 9 Pseudocyclic Association Schemes and Strongly Regular Graphs
Let X be a pseudocyclic association scheme in which all the nontrivial relations are strongly regular graphs with the same eigenvalues. We prove that the principal part of the first eigenmatrix of X is a linear combination of an incidence matrix of a symmetric design and the all-ones matrix. Amorphous pseudocyclic association schemes are examples of such association schemes whose associated sym...
متن کاملQuadrance polygons, association schemes and strongly regular graphs
Quadrance between two points A1 = [x1, y1] and A2 = [x2, y2] is the number Q(A1, A2) := (x2 − x1) + (y2 − y1). In this paper, we present some interesting results arise from this notation. In Section 1, we will study geometry over finite fields under quadrance notations. The main purpose of Section 1 is to answer the question, for which a1, . . . an, we have a polygon A1 . . . An such that Q(Ai,...
متن کاملOn Pseudocyclic Association Schemes
The notion of pseudocyclic association scheme is generalized to the non-commutative case. It is proved that any pseudocyclic scheme the rank of which is much more than the valency is the scheme of a Frobenius group and is uniquely determined up to isomorphism by its intersection number array. An immediate corollary of this result is that any scheme of prime degree, valency k and rank at least k...
متن کاملStrongly regular graphs
Strongly regular graphs form an important class of graphs which lie somewhere between the highly structured and the apparently random. This chapter gives an introduction to these graphs with pointers to more detailed surveys of particular topics.
متن کاملDisconnecting strongly regular graphs
In this paper, we show that the minimum number of vertices whose removal disconnects a connected strongly regular graph into non-singleton components, equals the size of the neighborhood of an edge for many graphs. These include blocks graphs of Steiner 2-designs, many Latin square graphs and strongly regular graphs whose intersection parameters are at most a quarter of their valency.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2010
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2009.08.003